package com.wyp168.leetcode;

import java.util.HashSet;
import java.util.Set;

/**
 * @ClassName PossibleBipartitionSolution
 * @Title TODO
 * @Description TODO
 * @Author wyp168
 * @Date 2022/10/16 01:34
 */
public class PossibleBipartitionSolution {
    public static void main(String[] args) {
        PossibleBipartitionSolution solution = new PossibleBipartitionSolution();
    }

    public boolean possibleBipartition(int n, int[][] dislikes) {
        Set<Integer> group01 = new HashSet<>();
        Set<Integer> group02 = new HashSet<>();

        for (int[] dislike : dislikes) {
            if (group01.contains(dislike[0])) {
                if (group01.contains(dislike[1])) {
                    return false;
                } else {
                    group02.add(dislike[1]);
                }
            }
//            } else if (group02.contains())
        }
        //TODO
        return false;
    }
}
